Approximate truth and Łukasiewicz logic

نویسنده

  • Thomas S. Weston
چکیده

Lukasiewicz' infinite-valued logic L has been used by a number of authors to study reasoning with vague, "fuzzy", or uncertain statements ([5], [2], [11], [12]). Scott and, more recently, Katz have also argued that L is appropriate for the logic of degrees of error or degrees of approximation to the truth ([6], p. 421 and [4], p. 773). The aim of this note is to show that L is not appropriate for this purpose, regardless of its possible application to vagueness, and to derive a few facts about alternative systems which are appropriate, or more nearly so. Both Scott and Katz indicate that a leading idea in their analysis of degree of error is the case of equations r = s, where some metric is used to measure the distance between r and s. If r and s are reals, then a convenient example is the metric |r — s|. In this case, r = s true iff |r — s\ = 0, and if r Φ s, \r — s| measures the degree of error of the equation r = s9 larger values indicating larger errors. Scott and Katz both use L to extend to compound formulas the measure of error that a metric like | r — s\ gives for equations. My contention that L does not do this correctly is based on the following claim: If we are to take at all seriously the idea that the "truth values" of our system measure the degree of error, we must insist that true statements have zero error. This aim is, of course, already met for the equation example just mentioned, but we ought to meet it for all statements whose "nearness" to the truth is to be assessed. In fact, it is just the property that true statements are zero distance from the truth —call it the "accuracy property"—that distinguishes an assessment of accuracy, at which Scott and Katz are clearly aiming, from an assessment of proximity to the comprehensive truth, which is the aim (or an aim) of the theories of so-called verisimilitude or truthlikeness and of theories of vagueness. A statement can be inaccurate only by stating something which is false. It may be less than the comprehensive truth, on the other hand, merely by sins of omission. Similarly, a statement might possess some degree of vagueness and still be true, but it could not possess any degree of inaccuracy and still be true.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Lukasiewicz Logic with Truth Constants

Canonical completeness results for Ł(C), the expansion of Łukasiewicz logic Ł with a countable set of truth-constants C, have been recently proved in [5] for the case when the algebra of truth constants C is a subalgebra of the rational interval [0, 1] ∩ Q. The case when C 6⊆ [0, 1] ∩ Q was left as an open problem. In this paper we solve positively this open problem by showing that Ł(C) is stro...

متن کامل

Complete Sets of Connectives for Generalized Łukasiewicz Logics

While ∧,∨,¬ form a complete set of connectives for classical propositional logic, this does not hold for Łukasiewicz’s three-valued propositional logic, nor its generalization to n-valued logic. We define a unary connective r so that ∧,∨,¬, r form a complete set of connectives for n-valued Łukasiewicz logic. We discuss generalizations of this to infinitary logics. If we allow infinite conjuncti...

متن کامل

Łukasiewicz Fuzzy EL is Undecidable

Fuzzy Description Logics have been proposed as formalisms for representing and reasoning about imprecise knowledge by introducing intermediate truth degrees. Unfortunately, it has been shown that reasoning in these logics easily becomes undecidable, when infinitely many truth degrees are considered and conjunction is not idempotent. In this paper, we take those results to the extreme, and show ...

متن کامل

Symbolic Knowledge Extraction using Łukasiewicz Logics

This work describes a methodology that combines logic-based systems and connectionist systems. Our approach uses finite truth-valued Lukasiewicz logic, wherein every connective can be defined by a neuron in an artificial network [1]. This allowed the injection of first-order formulas into a network architecture, and also simplified symbolic rule extraction. For that we trained a neural networks...

متن کامل

Labelled Calculi for Lukasiewicz Logics

In this paper, we define new decision procedures for Łukasiewicz logics. They are based on particular integer-labelled hypersequents and of logical proof rules for such hypersequents. These rules being proved strongly invertible our procedures naturally allow one to generate countermodels. From these results we define a “merge”-free calculus for the infinite version of Łukasiewicz logic and pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 29  شماره 

صفحات  -

تاریخ انتشار 1988